Efficient channel search with sequential probability ratio testing

ABSTRACT

Methods and systems for cognitive radio channel searching are shown that include determining an upper threshold and a lower threshold that will find a free channel in a minimum average searching time based on a channel occupancy probability π0 and the number of channels K, constrained by a target acceptable misdetection probability and a target acceptable false alarm probability. The K channels are searched with a signaling device using the determined upper threshold and lower threshold to find a free channel.

RELATED APPLICATION INFORMATION

This application claims priority to provisional application Ser. No. 61/313,389 filed on Mar. 12, 2010, incorporated herein by reference. This application further claims priority to provisional application Ser. No. 61/313,396 filed on Mar. 12, 2010, incorporated herein by reference. This application is further related to application serial no. TBD, (Attorney Docket No. 09081 (449-175)), filed concurrently herewith, incorporated herein by reference.

BACKGROUND

1. Technical Field

The present invention relates to multichannel systems and, in particular, to systems and methods for efficient channel searching in cognitive radio.

2. Description of the Related Art

In a cognitive radio (CR) network, secondary (unlicensed) users (SUs) are allowed to opportunistically access a licensed spectrum that is not currently being occupied by primary (licensed) users (PUs). Spectrum sensing in a CR network allows a network to protect primary transmissions from interferences due to secondary usage of the spectrum. Extant techniques for spectrum sensing rely on unrealistic assumptions, expensive equipment, and highly complex methods.

SUMMARY

A method for cognitive radio channel searching is shown that includes determining an upper threshold and a lower threshold that will find a free channel in a minimum average searching time based on a channel occupancy probability π₀ and the number of channels K, constrained by a target acceptable misdetection probability and a target acceptable false alarm probability. The method also includes searching the K channels with a signaling device using the determined upper threshold and lower threshold to find a free channel.

A method for cognitive radio channel searching is shown that includes determining an upper threshold and a lower threshold that will find a free channel in a minimum average searching time based on a channel occupancy probability π₀ and the number of channels K, constrained by a target acceptable misdetection probability and a target acceptable false alarm probability. The determination further includes minimizing an average searching time according to an expected false alarm probability and an expected misdetection probability. The method also searches the K channels with a signaling device by sampling a channel, calculating a log-likelihood ratio (LLR) for the samples for each channel k, and comparing the LLR to the upper and lower thresholds to determine whether the channel is free or busy.

A cognitive radio device is shown that includes a search parameter determination module configured to determine an upper threshold and a lower threshold that will find a free channel in a minimum average searching time based on a channel occupancy probability π₀ and the number of channels K, constrained by a target acceptable misdetection probability and a target acceptable false alarm probability. The device further includes a search module configured to search the multiple channels with a signaling device using the determined upper threshold and lower threshold to find a free channel.

These and other features and advantages will become apparent from the following detailed description of illustrative embodiments thereof, which is to be read in connection with the accompanying drawings.

BRIEF DESCRIPTION OF DRAWINGS

The disclosure will provide details in the following description of preferred embodiments with reference to the following figures wherein:

FIG. 1 is a block diagram of a secondary user searching for a free channel.

FIG. 2 is a graph which illustrates a sequential probability ratio test (SPRT).

FIG. 3 is a block/flow diagram of sequential SPRT for multiple channels.

FIG. 4 is a graph which illustrates an energy detection (ED) test.

FIG. 5 is a block/flow diagram of a sequential ED test for multiple channels according to the present principles.

FIG. 6 is a block/flow diagram of an S-SPRT methodology including search design.

FIG. 7 is a block/flow diagram of an S-ED methodology including search design.

FIG. 8 is a diagram of an exemplary cognitive radio transceiver.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

The present principles quickly and accurately locate an unoccupied channel (or determine that there is no unoccupied channel) from a set of multiple candidate channels, for a secondary user (SU) with a single detector. The SU can only observe one channel at a time and needs to switch from one channel to another when necessary. A design criterion is provided that minimizes the average searching time subject to the constraints on the error probabilities. Notably, the design criterion described below does not depend on a cost structure. Using this design criterion, two efficient channel search methods with simple structures are provided. The two methods strike an advantageous tradeoff among detection delay at each channel, switching delays, and the error probabilities in a multichannel setup.

Embodiments described herein may be entirely hardware, entirely software or including both hardware and software elements. In a preferred embodiment, the present invention is implemented in software, which includes but is not limited to firmware, resident software, microcode, etc.

Embodiments may include a computer program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer or any instruction execution system. A computer-usable or computer readable medium may include any apparatus that stores, communicates, propagates, or transports the program for use by or in connection with the instruction execution system, apparatus, or device. The medium can be magnetic, optical, electronic, electromagnetic, infrared, or semiconductor system (or apparatus or device) or a propagation medium. The medium may include a computer-readable storage medium such as a semiconductor or solid state memory, magnetic tape, a removable computer diskette, a random access memory (RAM), a read-only memory (ROM), a rigid magnetic disk and an optical disk, etc.

A data processing system suitable for storing and/or executing program code may include at least one processor coupled directly or indirectly to memory elements through a system bus. The memory elements can include local memory employed during actual execution of the program code, bulk storage, and cache memories which provide temporary storage of at least some program code to reduce the number of times code is retrieved from bulk storage during execution. Input/output or I/O devices (including but not limited to keyboards, displays, pointing devices, etc.) may be coupled to the system either directly or through intervening I/O controllers.

Network adapters may also be coupled to the system to enable the data processing system to become coupled to other data processing systems or remote printers or storage devices through intervening private or public networks. Modems, cable modem and Ethernet cards are just a few of the currently available types of network adapters.

Referring now to the drawings in which like numerals represent the same or similar elements and initially to FIG. 1, a narrow-band communication system is shown in which an SU 104 is allowed to opportunistically access a licensed spectrum consisting of K non-overlapping channels 102 with equal bandwidth. It is assumed that the SU 104 has a single detector at its transmitter operating in half-duplex mode. Each channel has two possible states: “free” (e.g., 102-3) or “busy” (e.g., 102-1). A channel is said to be busy if the channel is currently being used by a primary user (PU) or SU. It is assumed herein that only one SU is present, but the present principles may be extended to detect other SUs as long as the average signal power of the SU is known. It may be further assumed that the states of the channels 102 are independent and identically distributed, such that the state of each channel is independent from the state of the others and each channel has the same prior probability π₀ of being free. The prior probability π₀, may be found by observing PU activity over time, and then used in subsequent channel searches. The SU needs to quickly find a free channel, or determine that there is no free channel, from the K candidate channels with a small chance of error.

For the k^(th) channel 102, where k ε[1,K], let {y₁ ^((k)),y₂ ^((k)), . . . } be a set of samples of channel k. For the free and busy states H (denoted as 0 and 1 respectively), the observed signals can be expressed as:

H ₀ ^((k))(state 0):y _(n) ^((k)) =w _(n) ⁽ k),n=1,2,  (1)

H ₁ ^((k))(state 1):y _(n) ^((k)) =h ^((k)) s _(n) ^((k)) +w _(n) ^((k)) ,n=1,2,  (2)

where w_(n) ^((k)) is modeled as an additive white Gaussian noise with variance σ_(w) ² independent of the channel index (i.e., w_(n) ^((k))˜CN(0,σ_(w) ²)), h^((k)) is the kth channel coefficient between the PU using the channel and the SU 104, and s_(n) ^((k)) denotes the primary signals transmitted over channel k at time instant n. It may further be assumed that: 1. the state of a channel 102 remains unchanged during the detection process, 2. the primary signal for 2 samples are independent and identically distributed with E(|s_(n) ^((k))|²)=σ_(s) ², a parameter independent of channel index, and 3. the channel gain h^((k)) is perfectly known at the SU 104. The signal-to-noise ratio (SNR) may be defined as ξ:=|h^((k))|²σ_(s) ²/σ_(w) ². The SU 104 performs a detection scheme to test H₀ ^((k)) against H₁ ^((k)) until a free channel is located or all the channels 102 are detected as busy.

Two sensing schemes in the single-channel case are relevant to the multi-channel case. The first is the sequential probability ratio test (SPRT) and the second is energy detection (ED). In SPRT, an accumulative log-likelihood ratio (LLR) is compared with two predetermined thresholds to test the null hypothesis H₀ against the alternative hypothesis H₁. To be more precise, the LLR of N received samples may be expressed as

$\begin{matrix} {{\Lambda_{N} = {\sum\limits_{n = 1}^{N}\; {\log \frac{p_{1}\left( y_{n} \right)}{p_{0}\left( y_{n} \right)}}}},} & (3) \end{matrix}$

where y_(n) denotes the received signal at time n, and p₀(x) and p₁(x) are the probability density functions under H₀ and H₁ respectively. At the N^(th) time instant, the SPRT procedure is given as follows:

Reject H₀:Λ_(N)≧a_(s)  (4)

Accept H₀:Λ_(N)≦b_(s)  (5)

Continue Sensing:a_(s)<Λ_(N)<b_(s)  (6)

where a_(s) and b_(s) are two predetermined thresholds. For given false-alarm and misdetection probabilities α and β, a_(s) and b_(s) can be determined as follows:

$\begin{matrix} {a_{s} = {{\log \frac{\beta}{1 - \alpha}\mspace{14mu} {and}\mspace{14mu} b_{s}} = {\log \frac{1 - \beta}{\alpha}}}} & (7) \end{matrix}$

Note that assumption a_(s)<b_(s) implies α+β<1.

Referring now to FIG. 2, a graph is shown comparing the test statistic to the thresholds a_(s) 204 and b_(s) 202 in the single channel case for an exemplary SPRT embodiment. The vertical axis represents the updated test statistic for each sample y_(n) ^((k)) 206, and the horizontal axis represents a number of samples. As the samples accumulate, the test statistic is updated and progressively compared to the given thresholds. If the test statistic exceeds a_(s) 204, the hypothesis H₀ (that the channel is free) is rejected. If the test statistic falls below b_(s) 202, the hypothesis H₀ is accepted. If a maximum N samples are collected, a final decision is made by comparing the test statistic to a third threshold.

Referring now to FIG. 3, a block/flow diagram is shown using an exemplary sequential SPRT embodiment. A channel is selected at block 302. The signal on the selected channel is sampled at block 303, and an LLR is computed for that received sample at block 304. Block 306 then updates a cumulative LLR ratio for the current channel using the computed LLR. Block 308 determines whether the cumulative LLR has exceeded one of the thresholds. If not, processing returns to block 303 and the signal is sampled further. If so, block 309 determines whether the LLR exceeded the lower threshold. If the lower threshold was exceeded, block 310 determines that the selected channel is free. Otherwise, block 311 determines that the selected channel is busy. Block 312 determines whether the selected channel was the last channel from a set of K channels. If so, block 314 determines that all channels are busy. If not, a new channel is selected at block 302 and processing resumes.

Let Z_(n), denote log(p₁(y_(n))/p₀(y_(n))). Define μ₀=E(Z_(n)|H₀) and μ₁=E(Z_(n)|H₁). Let t_(s) be the number of the samples required to reach a decision. Clearly, t_(s) is a random variable. Under H₀, the average sample number (ASN) can be approximated as E(t_(s)|H₀)=((1−a)a_(s)+ab_(s))/μ₀, whereas under H₁, the ASN can be approximated as E(t_(s)|H₁)=(βa_(s)+(1−β)b_(s))/μ₁. The ASN can be approximated as

$\begin{matrix} \begin{matrix} {{E\left( t_{s} \right)} = {{{E\left( {t_{s}H_{0}} \right)}\pi_{0}} + {{E\left( {t_{s}H_{1}} \right)}\left( {1 - \pi_{0}} \right)}}} \\ {\approx {{\frac{\pi_{0}}{\mu_{0}}\left\lbrack {{\left( {1 - \alpha} \right)\log \frac{\beta}{1 - \alpha}} + {\alpha \; \log \frac{1 - \beta}{\alpha}}} \right\rbrack} + \frac{1 - \pi_{0}}{\mu_{0}}}} \\ {\left\lbrack {{{\beta log}\frac{\beta}{1 - \alpha}} + {\left( {1 - \beta} \right)\log \frac{1 - \beta}{\alpha}}} \right\rbrack} \\ {= {{\left\lbrack {\frac{\pi_{0}\left( {1 - \alpha} \right)}{\mu_{0}} + \frac{\left( {1 - \pi_{0}} \right)\beta}{\mu_{1}}} \right\rbrack \log \frac{\beta}{1 - \alpha}} +}} \\ {\left\lbrack {\frac{\pi_{0}\alpha}{\mu_{0}} + \frac{\left( {1 - \pi_{0}} \right)\left( {1 - \beta} \right)}{\mu_{1}}} \right\rbrack} \\ {{\log \frac{1 - \beta}{\alpha}}} \end{matrix} & (8) \end{matrix}$

The approximation of E(t_(s)) in (8) becomes fairly accurate in the following two cases. The first case is when α and β are both very small while the second case is when p₁(x) is sufficiently close to p₀(x). In a CR network, the SU is required to detect the presence/absence of a PU with small error probabilities at a very low SNR. When the SNR is sufficiently low, p₁(x) becomes fairly close to p₀(x), and thus the approximation in (8) is highly accurate.

In ED, the energy of the received signal samples is first computed and then is compared to a predetermined threshold. Let t_(e) be a fixed sample size and y be a t_(e)×1 vector defined as y=(y₁,y₂, . . . , y_(t)). The test procedure of the energy detection is given as

${T(y)} = {{\sum\limits_{i = 1}^{t_{r}}\; {y_{i}}^{2}}\underset{\underset{H_{0}}{\leq}}{\overset{\overset{H_{1}}{\geq}}{=}}\lambda}$

where T(y) denotes the test statistic, and λ denotes the threshold for energy detection.

Unlike in the SPRT, the sample size t_(e) in energy detection is a fixed parameter, which is determined by the target false-alarm probability α, the misdetection probability β, and a SNR value. Let t_(e) ^(min) be the minimum sample number required to achieve the target false-alarm probability α and misdetection probability β when the SNR is ξ. This produces:

t _(e) ^(min)=┌(ξ⁻² [Q ⁻¹(α)−Q ⁻¹(1−β)√{square root over (2ξ+1)}]²)┐  (9)

where ┌x┐ denotes the smallest integer not less than x, and Q( ) is the complementary cumulative distribution function of the standard normal random variable, i.e., Q(x):=(2π)^(−1/2)∫e^(−u2/2)du, while Q⁻¹( ) denotes its inverse function. Note that like the SPRT, (9) holds true only when α+β<1.

Referring now to FIG. 4, a graph is shown comparing the single-channel energy detection test statistic to the threshold λ 402. The vertical axis represents the test statistic for a set of samples 404, and the horizontal axis represents a number of samples. After t_(e) samples 406 have been collected, the test statistic T(y) is compared. If the test statistic exceeds the threshold λ402 the hypothesis H₀ (that the channel is free) is rejected. If the test statistic is below λ 402, the hypothesis H₀ is accepted.

Referring now to FIG. 5, a block/flow diagram is shown for finding a free channel using an exemplary sequential ED embodiment. At block 502, the SU 104 selects a new channel which has not been tested yet. Changing the central frequency of the observing channel causes a switching delay. Block 503 then collects N samples {y₁ ^((k)),y₂ ^((k)), . . . } on the channel. Block 504 squares the magnitude of the received single samples y_(n) ^((k)), allowing block 506 to compute a test statistic

$\Lambda_{N}^{(k)} = {\sum\limits_{n = 1}^{N}\; {{y_{n}^{(k)}}^{2}.}}$

Block 508 determines whether the test statistic is greater than or equal to a threshold γ. If so, the current channel is declared free at block 509 and the SU uses said channel. If not, the current channel is declared busy at block 510. Block 512 determines if there are untested channels remaining. If not, block 514 declares that all channels are busy and processing ends. If so, processing returns to block 502 and a new channel is selected.

When designing a cognitive radio system, two error probabilities play a role: the false alarm probability P_(FA) ^(mc) and the misdetection probability P_(MD) ^(mc). Because the states of the K channels are independent and have the same a priori probabilities, it is assumed that each channel has the same target false-alarm probability α and the target same misdetection probability β as defined in the single channel case. From a practical viewpoint, it is assumed that α>0, β>0, and α+β>0. The misdetection probability and the false alarm probability are used to form search parameters in S-ED and S-SPRT, as discussed below in FIGS. 6 and 7.

The false-alarm probability P_(FA) ^(mc) is defined as the probability of determining that all channels are busy while in fact there exists at least one free channel. Let E_(i) denote the event that there exist exactly i free channels for i=1, . . . , K and let D₁ denote the event that the SU determines that all channels are busy. The false-alarm probability P_(FA) ^(mc) is then P(D₁|∪_(i=1) ^(K)E_(i)). Mathematically, P_(FA) ^(mc) can be computed as follows:

$\begin{matrix} \begin{matrix} {P_{FA}^{mc} = {P\left( {D_{1}{\bigcup_{i = 1}^{K}E_{i}}} \right)}} \\ {= \frac{P\left( {D_{1}\bigcap{\bigcup_{i = 1}^{K}E_{i}}} \right)}{P\left( {\bigcup_{i = 1}^{K}E_{i}} \right)}} \\ {= \frac{P\left( {\bigcup_{i = 1}^{K}\left( {D_{1}\bigcap E_{i}} \right)} \right)}{P\left( {\bigcup_{i = 1}^{K}E_{i}} \right)}} \\ {= {\frac{\sum\limits_{i = 1}^{K}{P\left( {D_{1}\bigcap E_{i}} \right)}}{P\left( {\bigcup_{i = 1}^{K}E_{i}} \right)}.}} \end{matrix} & (11) \end{matrix}$

Using the fact that the events E_(i) are disjoint, P(∪_(i=0) ^(K)E_(i)) is equal to 1, and the states of the channels are independent, one arrives at P(∪_(i=0) ^(K)E_(i))=1−(1−π₀)^(K). P(D₁∩E_(i)) is now computed. For any particular event from E_(i), for example E_(i) ⁰, P(D₁∩E_(i) ⁰) can be rewritten as

P(D ₁ ∩E _(i) ⁰)=P(D ₁ |E _(i) ⁰)P(E _(i) ⁰)=[απ₀]^(i)[(1−β)(1−π₀)]^(K-i)  (12)

E_(i) includes

$\begin{pmatrix} K \\ i \end{pmatrix}\quad$

disjoint such events. Hence,

$\begin{matrix} {{P\left( {D_{1}\bigcap E_{i}} \right)} = {\begin{pmatrix} K \\ i \end{pmatrix}{\quad{{\left\lbrack {\alpha \; \pi_{0}} \right\rbrack^{i}\left\lbrack {\left( {1 - \beta} \right)\left( {1 - \pi_{0}} \right)} \right\rbrack}^{K - i}.}}}} & (13) \end{matrix}$

From (11), (12), and (13),

$\begin{matrix} \begin{matrix} {P_{FA}^{mc} = \frac{\sum\limits_{i = 1}^{K}{\begin{pmatrix} K \\ i \end{pmatrix}{\quad{\left\lbrack {\alpha \; \pi_{0}} \right\rbrack^{i}\left\lbrack {\left( {1 - \beta} \right)\left( {1 - \pi_{0}} \right)} \right\rbrack}^{K - i}}}}{1 - \left( {1 - \pi_{0}} \right)^{K}}} \\ {= \frac{\left\lbrack {{\alpha \; \pi_{0}} + {\left( {1 - \beta} \right)\left( {1 - \pi_{0}} \right)}} \right\rbrack^{K} - \left\lbrack {\left( {1 - \beta} \right)\left( {1 - \pi_{0}} \right)} \right\rbrack^{K}}{1 - \left( {1 - \pi_{0}} \right)^{K}}} \end{matrix} & (14) \end{matrix}$

Unlike the false-alarm probability in the single channel case, P_(FA) ^(mc) depends on π₀ in general except that P_(FA) ^(mc) reduces to α when K=1. Two monotonic properties of P_(FA) ^(mc) are described herein with respect to π₀ and β, respectively. First, the false alarm probability P_(FA) ^(mc) is a monotonically decreasing function on π₀ for given α and β. The least upper bound on P_(FA) ^(mc) is given by α(1−β)^(K-1) for any 0<π₀<1, i.e., sup_(0<π) ₀ _(<1)P(D₁|∪_(i=1) ^(K)E_(i))=α(1−β)^(K-1) for 0<π₀<1. Second, for any given 0<α<1 and 0<π₀<1, the false alarm probability P_(FA) ^(mc) is a monotonically decreasing function of β.

The misdetection probability P_(MD) ^(mc) is defined as the probability of the event that a channel is determined to be free while it is in fact busy. Again, note that the misdetection probability is used to form search parameters for S-ED and S-SPRT, as shown below in FIGS. 6 and 7. Let τ denote the index of the channel at which the search ends. Let D^((τ)) denote the event that the SU determines that channels 1 to τ−1 are busy and channel τ is free, where τε{1, . . . , K}. With a slight abuse of notation, H₁ ^((τ)) is used to denote the event that channel τ is indeed busy. Following the definition of P_(MD) ^(mc) and the fact that D^((τ))∩H₁ ^((τ)) for τ=1, . . . , K are disjoint events, the overall misdetection probability of a multichannel system is written as Σ_(τ=1) ^(K)P(D^((τ))∩H₁ ^((τ))).

For a fixed τ:

$\begin{matrix} {{P\left( {D^{(\tau)}\bigcap H_{1}^{(\tau)}} \right)}\overset{(a)}{=}{{P\left( {D_{0}^{(\tau)}\bigcap H_{1}^{(\tau)}} \right)}{\prod\limits_{k = 1}^{\tau - 1}\; {P\left( D_{1}^{(k)} \right)}}}} \\ {= {{{P\left( {D_{0}^{(\tau)}H_{1}^{(\tau)}} \right)}{P\left( H_{1}^{(\tau)} \right)}{\prod\limits_{k = 1}^{\tau - 1}\; {{P\left( {D_{1}^{(k)}H_{1}^{(k)}} \right)}{P\left( H_{1}^{(k)} \right)}}}} +}} \\ {{{P\left( {D_{1}^{(k)}H_{0}^{(k)}} \right)}{P\left( H_{0}^{(k)} \right)}}} \\ {= {{\beta \left( {1 - \pi_{0}} \right)}\left\lbrack {{\left( {1 - \beta} \right)\left( {1 - \pi_{0}} \right)} + {\alpha \; \pi_{0}}} \right\rbrack}^{\tau - 1}} \\ {= {{\beta \left( {1 - \pi_{0}} \right)}\left\lbrack {{\left( {\alpha + \beta - 1} \right)\pi_{0}} + \left( {1 - \beta} \right)} \right\rbrack}^{\tau - 1}} \end{matrix}$

where D₁ ^((k)) denotes the event that the SU claims channel k as a busy channel for k=1, . . . , τ−1, D₁ ^((τ)) denotes the event that the SU claims channel τ as a free channel, (a) follows directly from the independence of received signal samples from each channel. Denoting (α+β−1)π₀+(1−β) by φ, this produces P(D^((τ))∩H₁ ^((τ)))=β(1−π₀)φ^(τ-1). P_(MD) ^(mc) can be written as

$\begin{matrix} \begin{matrix} {P_{MD}^{mc} = {\sum\limits_{\tau = 1}^{K}{P\left( {D^{(\tau)}\bigcap H_{1}^{(\tau)}} \right)}}} \\ {= {{\beta \left( {1 - \pi_{0}} \right)}{\sum\limits_{\tau = 1}^{K}\phi^{\tau - 1}}}} \\ {= {{\beta \left( {1 - \pi_{0}} \right)}\frac{1 - \phi^{K}}{1 - \phi}}} \end{matrix} & (15) \end{matrix}$

Unlike the misdetection probability in the single channel case, P_(MD) ^(mc) depends on a priori probability π₀. It should be noted that when K=1, P_(MD) ^(mc) does not reduce to the misdetection probability β in the single channel case. This is because the misdetection probability β in the single channel case is a conditional probability while P_(MD) ^(mc) is defined as a joint probability.

Two monotonic properties of the misdetection probability P_(MD) ^(mc) are described herein. First, the misdetection probability P_(MD) ^(mc) is a monotonically decreasing function of π₀. Furthermore, the least upper bound on P_(MD) ^(mc) for 0<π_(0<1) is given by 1−(1−β)^(K). Second, for any given 0<α<1 and 0<π₀<1, the misdetection probability P_(MD) ^(mc) is a monotonically increasing function of β.

Another relevant quantity to S-ED and S-SPRT searches, as discussed below in FIGS. 6 and 7, is the average searching time of a channel search scheme. A searching time is a random variable having a value that is the sum of detection time and switching delays. T denotes the channel searching time. Let t^((k)) be the sensing time spent on channel k and let δ denote one switching delay—the amount of time it takes to tune to a new channel. It may be assumed that the switching delay δ is a constant. Recall that τ is the index of the channel at which a search ends. Using Wald's identity, the average searching time E(T) is written as follows

$\begin{matrix} \begin{matrix} {{E(T)} = {E\left( {{\sum\limits_{k = 1}^{\tau}t^{(k)}} + {\left( {\tau - 1} \right)\delta}} \right)}} \\ {= {{{E(\tau)}\left( {{E(t)} + \delta} \right)} - \delta}} \end{matrix} & (16) \end{matrix}$

where E(t) denotes the expectation value of t^((k)). Note that in energy detection, t is a deterministic parameter and thus E(t) simply becomes t.

E(τ) may be evaluated now and represents the average number of channels 102 that have been visited by the SU 104. Clearly, τ is a random variable ranging from 1 to K Let P(τ=k) denote the probability of the event that the SU 104 completes the search at channel k. If 1≦k<K, then τ=k implies that the SU claims that the first k−1 channels are busy and that the k^(th) channel is free, while if k=K, τ=K implies that the SU 104 claims the first K−1 channels as busy channels. Based on these observations, P(τ=k) is written as

$\begin{matrix} {{P\left( {\tau = k} \right)} = \left\{ \begin{matrix} {{{{P\left( D_{0}^{(k)} \right)}{\prod\limits_{i = 1}^{k - 1}\; {P\left( D_{1}^{(l)} \right)}}} = {\left( {1 - \phi} \right)\phi^{k - 1}}},} & {{k = 1},\ldots \mspace{14mu},{K - 1}} \\ {{\prod\limits_{i = 1}^{K - 1}\; {P\left( D_{1}^{(l)} \right)}} = \phi^{K - 1}} & {k = {K.}} \end{matrix} \right.} & (17) \end{matrix}$

Then, the average number of the channels visited by the SU 104 is given by

$\begin{matrix} \begin{matrix} {{E(\tau)} = {\sum\limits_{k = 1}^{K}{{kP}\left( {\tau = k} \right)}}} \\ {= {{\left( {1 - \phi} \right){\sum\limits_{k = 1}^{K}{k\; \phi^{k - 1}}}} + {K\; \phi^{K}}}} \\ {= \frac{1 - \phi^{K}}{1 - \phi}} \end{matrix} & (18) \end{matrix}$

For given 0<α<1 and 0<π_(0<1), the average number of channels visited by the SU is a monotonically decreasing function of β.

Referring again to FIG. 2, a channel search applies a detection scheme sequentially 212 to each channel 102 and such a detection scheme guarantees the same target α and β for each channel 102. Hence, the design of a channel search includes the design of a detection scheme that is sequentially applied to a candidate channel 102 to minimize the average searching time, subject to constraints on the false-alarm and misdetection probabilities of a multichannel system. Mathematically, this is formulated as the following optimization problem:

$\begin{matrix} {\underset{\alpha,\beta}{minimize}\; {E(T)}} & (19) \\ {{{{subject}\mspace{14mu} {to}\text{:}\mspace{14mu} P_{FA}^{mc}} \leq {\overset{\_}{P}}_{FA}^{mc}},{P_{MD}^{mc} \leq {\overset{\_}{P}}_{MD}^{mc}},{\alpha > 0},{{{and}\mspace{14mu} \beta} > 0}} & \; \end{matrix}$

where P _(FA) ^(mc) and P _(MD) ^(mc) represent target false-alarm and misdetection probabilities in a multichannel system. Advantageous characteristics of (19) include the minimization problem (19) being independent of a particular cost structure and taking switching delays into account.

In an SPRT-based channel search algorithm, an SPRT is sequentially applied to the candidate channels to achieve target P _(FA) ^(mc) and P _(MD) ^(mc) for a multichannel system. The present principles therefore provide a sequential SPRT (S-SPRT) search.

Referring now to FIG. 6, a block/flow diagram of S-SPRT is shown, including the search design. Block 602 incorporates the steps of designing an S-SPRT search, which includes finding an acceptable probability of false alarm at block 604, finding an acceptable probability of misdetection at block 606, setting an acceptable average searching time at block 608, and determining an a priori probability that any given channel is already occupied 609. These quantities are then used to determine an upper and a lower threshold at blocks 610 and 612 respectively. The thresholds are subsequently used in block 614 to locate a free channel, as described in FIG. 3 above.

Recall that the overall false-alarm and misdetection probabilities P_(FA) ^(mc) and P_(MD) ^(mc) E(T) are functions of α and β, which are false-alarm and misdetection probabilities achieved by a SPRT on a single channel, respectively. Recall that in an SPRT, α and βneed to satisfy α>0, β>0, and α+β<1. Using (8) and (18), (16) is rewritten as

$\begin{matrix} {{{\min\limits_{\alpha,\beta}{E(T)}} = {{\frac{1 - \left( {{\left( {\alpha + \beta - 1} \right)\pi_{0}} + \left( {1 - \beta} \right)} \right)^{K}}{\beta - {\left( {\alpha + \beta - 1} \right)\pi_{0}}}\begin{pmatrix} {\left\lbrack {\frac{\pi_{0}\left( {1 - \alpha} \right)}{\mu_{0}} + \frac{\left( {1 - \pi_{0}} \right)\beta}{\mu_{1}}} \right\rbrack \times} \\ {{\log \frac{\beta}{1 - \alpha}} +} \\ {{\left\lbrack {\frac{\pi_{0}\alpha}{\mu_{0}} + \frac{\left( {1 - \pi_{0}} \right)\left( {1 - \beta} \right)}{\mu_{1}}} \right\rbrack \log \frac{1 - \beta}{a}} + \delta} \end{pmatrix}} - \delta}}{{{subject}\mspace{14mu} {to}\text{:}\frac{\left\lbrack {{\alpha\pi}_{0} + {\left( {1 - \beta} \right)\left( {1 - \pi_{0}} \right)}} \right\rbrack^{K} - \left\lbrack {\left( {1 - \beta} \right)\left( {1 - \pi_{0}} \right)} \right\rbrack^{K}}{1 - \left( {1 - \pi_{0}} \right)^{K}}} \leq {\overset{\_}{P}}_{FA}^{mc}}\mspace{79mu} {{{\beta \left( {1 - \pi_{0}} \right)}\frac{1 - \left( {{\left( {\alpha + \beta - 1} \right)\pi_{0}} + \left( {1 - \beta} \right)} \right)^{K}}{\beta - {\left( {\alpha + \beta - 1} \right)\pi_{0}}}} \leq {\overset{\_}{P}}_{MD}^{mc}}\mspace{79mu} {{\alpha + \beta} < 1}\mspace{79mu} {\alpha > 0}\mspace{79mu} {\beta > 0.}} & (20) \end{matrix}$

The objective function in (20), used in blocks 610 and 612, becomes accurate when both α and β are small or p₁(x) is fairly close to p₀(x). In general, the optimal values of α and βare not necessarily small. However, in a cognitive radio network, the case often arises where ξ is very low. In such a case, p₀(x) and p₁(x) are quite close and thus the objective function using the Wald's approximation becomes accurate.

In the energy detection based channel search algorithm, energy detection is applied sequentially to each channel. This energy detection based channel search is called a sequential energy detection (S-ED) search.

Referring now to FIG. 7, a block/flow diagram of S-ED is shown, including the search design. Block 702 incorporates the steps of designing an S-ED search, which includes finding an acceptable probability of false alarm at block 704, finding an acceptable probability of misdetection at block 706, setting an acceptable average searching time at block 708, and determining an a priori probability that any given channel is already occupied 709. These quantities are then used to determine a sample number and threshold at blocks 710 and 712 respectively. Detailed explanations and formulas for these quantities are provided above. The sample number and the threshold are subsequently used in block 714 to locate a free channel, as described in FIG. 5 above.

It can be assumed that the sample size in energy detection is chosen by (9) in block 710. According to (19):

$\begin{matrix} {{{\min\limits_{\alpha,\beta}{E(T)}} = {{\frac{1 - \left( {{\left( {\alpha + \beta - 1} \right)\pi_{0}} + \left( {1 - \beta} \right)} \right)^{K}}{\beta - {\left( {\alpha + \beta - 1} \right)\pi_{0}}}\left( {\left\lceil {\xi^{- 2}\left\lbrack {{Q^{- 1}(\alpha)} - {{Q^{- 1}\left( {1 - \beta} \right)}\sqrt{{2\xi} + I}}} \right\rbrack}^{1} \right\rceil + \delta} \right)} - \delta}}{{{subject}\mspace{14mu} {to}\text{:}\frac{\left\lbrack {{\alpha\pi}_{0} + {\left( {1 - \beta} \right)\left( {1 - \pi_{0}} \right)}} \right\rbrack^{K} - \left\lbrack {\left( {1 - \beta} \right)\left( {1 - \pi_{0}} \right)} \right\rbrack^{K}}{1 - \left( {1 - \pi_{0}} \right)^{K}}} \leq {\overset{\_}{P}}_{FA}^{mc}}\mspace{79mu} {{{\beta \left( {1 - \pi_{0}} \right)}\frac{1 - \left( {{\left( {\alpha + \beta - 1} \right)\pi_{0}} + \left( {1 - \beta} \right)} \right)^{K}}{\beta - {\left( {\alpha + \beta - 1} \right)\pi_{0}}}} \leq {\overset{\_}{P}}_{MD}^{mc}}\mspace{79mu} {{\alpha + \beta} < 1}\mspace{79mu} {\alpha > 0}\mspace{79mu} {\beta > 0.}} & (21) \end{matrix}$

In energy detection, the fixed sample size t_(e) in (9) is obtained in block 710 based on the central limit theorem, which assumes that t_(e) is sufficiently large. Roughly speaking, the values of t_(e) become sufficiently large when the optimal values of α and β are sufficiently small or the SNR value is very low. Similar to the S-SPRT case, the optimal α or β is not necessarily small. However, since the low SNR detection is of practical interest in a CR network, the objective function in (9) is an accurate approximation at a low SNR level.

In order to determine an energy threshold λ in block 712 for S-ED, equation (9) is used to produce t_(e) using the same ε that is shown in the single-channel case. α is acquired from equation (21) and used in the formula:

λ=Q ⁻¹(α)σ_(w) ²/√{square root over (t _(e) ^(min))}+σ_(w) ²

to find a suitable energy threshold. Problems (20) and (21) are nonlinear optimization problems and are not convex or concave in general. Finding a globally optimal solution is typically difficult. Since the optimization problems (20) and (21) have only two parameters α and β that belong to a finite interval [0,1], one feasible approach to find a good suboptimal solution is an enumerative search solution. Specifically, α and β are first quantized into discrete sets with small and even quantization intervals. Then an exhaustive enumeration of all possible quantized pairs (α,β) is performed to find a solution. The obtained solution may not be the optimal solution. Yet the enumerative search solution normally yields a good suboptimal solution as the quantization interval is sufficiently small. In addition, E(t) in the above two search algorithms is nondecreasing with respect to β. This implies that the optimal α and β should satisfy the constraint on P_(MD) ^(mc) with equality, i.e., P_(MD) ^(mc)= P _(MD) ^(mc) for the optimal α and β. In practice, this observation can be used to reduce the number of possible α and β pair values to be searched.

In simulations, it is assumed that the primary signals are independent and identically distributed complex Gaussian random values with mean zero and variance σ_(s) ². Under this assumption, the probability density function (PDF) of y_(n) ^((k)) under H₀, can be written as

$\begin{matrix} {{p_{0}\left( y_{n}^{(k)} \right)} = {\frac{1}{{\pi\sigma}_{w}^{2}}{\exp\left( {- \frac{{y_{n}^{(k)}}^{2}}{\sigma_{w}^{2}}} \right)}}} & (22) \end{matrix}$

whereas the PDF of y_(n) ^((k)) under H₁ can be written as

$\begin{matrix} {{p_{1}\left( y_{n}^{(k)} \right)} = {\frac{1}{\pi \left( {\sigma_{s}^{2} + \sigma_{w}^{2}} \right)}{{\exp\left( {- \frac{{y_{n}^{(k)}}^{2}}{\sigma_{s}^{2} + \sigma_{w}^{2}}} \right)}.}}} & (23) \end{matrix}$

The LLR of the received sample from channel k can be written as

$Z_{n}^{(k)} = {{\log \frac{p_{1}\left( y_{n}^{(k)} \right)}{p_{0}\left( y_{n}^{(k)} \right)}} = {{\log \; r} + {{y_{n}^{(k)}}^{2}\left( {\frac{1}{\sigma_{w}^{2}} - \frac{1}{\sigma_{w}^{2} + \sigma_{s}^{2}}} \right)}}}$

where r=(1+ξ)⁻¹. Furthermore, μ₀=log r+1−r and μ₁=log r+r⁻¹.

The above-described embodiments can be better understood in the context of the example scenario described in Table I. Table I lists numerical and simulation results of P_(FA) ^(mc), P_(MD) ^(mc), E(τ) and E(T) for K=8, π₀=0.5 and ξ=−5, −10, −15, −20 dB. The numerical results of P_(FA) ^(mc), P_(MD) ^(mc), E(τ) and E(T) are obtained by evaluating (14), (15), (18), and (16) at corresponding α and β, respectively. A few observations can be readily made from Table I. First, the values of the SNR ξ have considerable impact on the average searching time. Second, in both the S-SPRT and S-ED algorithms, the numerical and simulation results match quite well when ξ varies from −5 dB to −20 dB. This is because the SNR levels are fairly low. Particularly, in the S-SPRT search algorithm, the differences in P_(FA) ^(mc) and P_(MD) ^(mc) between numerical and simulation results become smaller as ξ decreases since p₁(x) becomes closer to p₀(x) as ξ decreases. Second, when ξ=−10, −15, −20 dB, the obtained α and β remain unchanged, which leads to the same value of E(τ).

TABLE 1 Methods S-SPRT S-ED S-SPRT S-ED S-SPRT S-ED S-SPRT S-ED ξ(dB) −5 −5 −10 −10 −15 −15 −20 −20 α 0.1706 0.1960 0.5589 0.5589 0.5589 0.5589 0.5589 0.5589 β 0.0929 0.0902 0.0553 0.0553 0.0553 0.0553 0.0553 0.0553 P_(FA) ^(mc) 0.0054 0.0069 0.1000 0.0999 0.1000 0.1000 0.1000 0.1000 (Numerical) P_(MD) ^(mc) 0.1000 0.1000 0.1000 0.1000 0.1000 0.1000 0.1000 0.1000 (Numerical) P_(FA) ^(mc) 0.0036 0.0068 0.0724 0.0970 0.0890 0.0993 0.0958 0.0998 (Monte Carlo) P_(MD) ^(mc) 0.0926 0.1001 0.1008 0.0927 0.0995 0.0971 0.1000 0.0996 (Monte Carlo) E(τ) 2.15 2.22 3.62 3.62 3.62 3.62 3.62 3.62 (Numerical) E(T) 139.5 207.2 533.8 1056.9 3886.4 8242.1 36833 77589 (Numerical) E(τ) 2.08 2.21 3.34 3.59 3.51 3.61 3.57 3.62 (Monte Carlo) E(T) 146.1 206.4 558.2 1048 3998.1 8221.9 37200 77769 (Monte Carlo)

Table II lists numerical and simulation results for P_(FA) ^(mc), P_(MD) ^(mc), E(τ) and E(T) for ξ=0 dB, K=8, P _(FA)= P _(MD)=0.1 and δ=0.1. As can be observed from the table, there exists some inconsistency between numerical results and simulation results. In particular, the constraints on P_(MD) ^(mc) are violated to some extent in the S-ED algorithm. This is mainly because the approximation based on the central limit theorem is no longer accurate when the fixed sample size t_(e) is relatively small.

TABLE 2 Methods S-SPRT S-ED S-SPRT S-ED S-SPRT S-ED π₀ 0.1 0.1 0.3 0.3 0.5 0.5 α 0.1604 0.1370 0.0500 0.0751 0.0293 0.0442 β 0.0196 0.0197 0.0477 0.0467 0.1081 0.1063 P_(FA) ^(mc) (Numerical) 0.1000 0.0845 0.0081 0.0127 0.0005 0.0007 P_(MD) ^(mc) (Numerical) 0.1000 0.1000 0.1000 0.1000 0.1000 0.1000 P_(FA) ^(mc) (Monte Carlo) 0.0492 0.0967 0.0042 0.0134 0.0003 0.0008 P_(MD) ^(mc) (Monte Carlo) 0.0866 0.1077 0.0806 0.1194 0.0820 0.1223 E(τ) (Numerical) 5.67 5.62 2.99 3.06 1.85 1.88 E(T) (Numerical) 269.9 354.6 130.5 161.1 60.7 72.1 E(τ) (Monte Carlo) 5.56 5.64 2.98 3.03 1.86 1.85 E(T) (Monte Carlo) 281.8 350.2 138.7 158.9 65.9 70.5

A third example shows how inaccurate knowledge of a priori probability π₀ affects the performance of the search algorithms. Let {circumflex over (π)}₀ be the estimate of π₀ and let {circumflex over (α)} and {circumflex over (β)} be the optimal parameters corresponding to {circumflex over (π)}₀, as calculated in blocks 604, 606, 704, and 706. In the following two cases, K=8, and P _(MD) ^(mc)= P _(FA) ^(mc)=0.1

The first case is underestimation, wherein ({circumflex over (π)}₀<π₀). It is assumed that the true value of π₀ is 0.8 and τ=−5 dB. Let E_(π) ₀ (T) denote the average searching time obtained by using α and β corresponding to {circumflex over (π)}₀ and E_({circumflex over (π)}) ₀ (T) denote the average searching time obtained in blocks 608 and 708 by using α and β corresponding to π₀. P_(FA) ^(mc) and P_(MD) ^(mc) are monotonically decreasing functions on π₀. This implies that α and β obtained from {circumflex over (π)}₀ will still meet the constraints on P_(FA) ^(mc) and P_(MD) ^(mc) as {circumflex over (π)}₀<π₀. Hence, only the impact of underestimating π₀ on E(t) is relevant. To do so, the parameter Δ_(U) is defined as ΔA_(U):=(E_(π) ₀ (T)−E_({circumflex over (π)}) ₀ (T))/E_(π) ₀ (T), which is used to indicate the sensitivity of E(T) to the underestimation of π₀. Δ_(U) decreases as the estimate {circumflex over (π)}₀ varies from 0.1 to 0.8. It can also be observed from the figure that both algorithms are sensitive to the underestimation of π₀ and the S-ED search algorithm is more sensitive than the S-SPRT search algorithm.

In the case of overestimation ({circumflex over (π)}₀>π₀), it is assumed that the true value of π₀ is 0.2 and ξ=−15 dB. In the overestimation case, α and β are obtained by using {circumflex over (π)}₀>π₀. Unlike the underestimation case, the constraints on P_(FA) ^(mc) and P_(MD) ^(mc) are not necessarily satisfied in the overestimation case. Recall that the optimal α and β, if any, always satisfy the constraint on P_(MD) ^(mc) with equality. Since P_(MD) ^(mc) is decreasing on π₀ and {circumflex over (π)}₀>π₀, α and β obtained in blocks 604, 606, 704, and 706 by assuming {circumflex over (π)}₀ will result in violation of the constraint on P_(MD) ^(mc). To study how the overestimation of π₀ affects the constraint on P_(MD) ^(mc) we define the parameter Δ_(O) as Δ_(O):=( P _(MD) ^(mc)−P_(MD) ^(mc))/P_(MD) ^(mc). Δ_(O) increases as the estimate {circumflex over (π)}₀ increases from 0.2 to 0.9. It can be also observed that both S-SPRT and S-ED suffer from similar amount of sensitivity to the overestimation of π₀.

Referring now to FIG. 8, an exemplary transceiver 802 is shown that implements a search designed according to the present principles. A processor 803 is used to design and implement a search for a free channel. A search design module 804 includes a requirements module 806 which stores or accepts (through user input) search requirements such as an acceptable misdetection probability, an acceptable false alarm probability, and an average search time. A parameter determination module 808 uses a processor to determine a number of samples and a threshold for use in the search. A search module 810 uses these parameters, where a sampling module 812 samples a channel the determined number of times via antenna 818, a test statistic module 814 uses a processor to calculate a test statistic based on the received samples, and a comparator 816 determines whether the test statistic exceeds the determined threshold. If the search module finds a free channel, the transceiver stays tuned to the channel and uses 818 to communicate.

Having described preferred embodiments of a system and method for cognitive radio channel searching with energy detection (which are intended to be illustrative and not limiting), it is noted that modifications and variations can be made by persons skilled in the art in light of the above teachings. It is therefore to be understood that changes may be made in the particular embodiments disclosed which are within the scope of the invention as outlined by the appended claims. Having thus described aspects of the invention, with the details and particularity required by the patent laws, what is claimed and desired protected by Letters Patent is set forth in the appended claims. 

1. A method for cognitive radio channel searching, comprising: determining an upper threshold and a lower threshold that will find a free channel in a minimum average searching time based on a channel occupancy probability π₀ and the number of channels K, constrained by a target acceptable misdetection probability and a target acceptable false alarm probability; and searching the K channels with a signaling device using the determined upper threshold and lower threshold to find a free channel.
 2. The method of claim 1, wherein determining comprises calculating an expected false alarm probability α and misdetection probability β based on the channel occupancy probability π₀ and the number of channels K.
 3. The method of claim 2, wherein the lower threshold a is calculated as $a_{s} = {\log {\frac{\beta}{1 - \alpha}.}}$
 4. The method of claim 2, wherein the upper threshold b is calculated as $b_{s} = {\log {\frac{1 - \beta}{\alpha}.}}$
 5. The method of claim 2, wherein determining comprises minimizing an average searching time according to the expected false alarm probability α and an expected misdetection probability β.
 6. The method of claim 5, wherein said minimizing accounts for a switching delay that arises from switching between channels.
 7. The method of claim 5, wherein said minimizing includes: ${\min\limits_{\alpha,\beta}{E(T)}} = {{\frac{1 - \left( {{\left( {\alpha + \beta - 1} \right)\pi_{0}} + \left( {1 - \beta} \right)} \right)^{K}}{\beta - {\left( {\alpha + \beta - 1} \right)\pi_{0}}}\begin{pmatrix} {\left\lbrack {\frac{\pi_{0}\left( {1 - \alpha} \right)}{\mu_{0}} + \frac{\left( {1 - \pi_{0}} \right)\beta}{\mu_{1}}} \right\rbrack \times} \\ {{\log \frac{\beta}{1 - \alpha}} +} \\ {{\left\lbrack {\frac{\pi_{0}\alpha}{\mu_{0}} + \frac{\left( {1 - \pi_{0}} \right)\left( {1 - \beta} \right)}{\mu_{1}}} \right\rbrack \log \frac{1 - \beta}{a}} + \delta} \end{pmatrix}} - \delta}$ $\mspace{79mu} {{subject}\mspace{14mu} {to}\text{:}\frac{\left\lbrack {{\alpha\pi}_{0} + {\left( {1 - \beta} \right)\left( {1 - \pi_{0}} \right)}} \right\rbrack^{K} - \left\lbrack {\left( {1 - \beta} \right)\left( {1 - \pi_{0}} \right)} \right\rbrack^{K}}{1 - \left( {1 - \pi_{0}} \right)^{K}}}$ being less than or equal to the target acceptable false alarm probability, ${\beta \left( {1 - \pi_{0}} \right)}\frac{1 - \left( {{\left( {\alpha + \beta - 1} \right)\pi_{0}} + \left( {1 - \beta} \right)} \right)^{K}}{\beta - {\left( {\alpha + \beta - 1} \right)\pi_{0}}}$ being less than or equal to the target acceptable misdetection probability, α+β<1, α>0, and β>0, where δ is a constant switching delay.
 8. The method of claim 1, wherein searching the K channels comprises collecting samples from each channel k and calculating a log-likelihood ratio (LLR) for the samples for each channel k.
 9. The method of claim 8, wherein searching the K channels further comprises comparing the LLR for each channel k to the determined upper and lower threshold to determine whether the channel is free or occupied.
 10. The method of claim 8, wherein the LLR Λ_(N) ^((k)) for a channel k is ${\Lambda_{N} = {\sum\limits_{n = 1}^{N}\; {\log \frac{p_{1}\left( y_{n} \right)}{p_{0}\left( y_{n} \right)}}}},$ where N is the maximum number of samples, y_(n) ^((k)) is the n^(th) sample on channel k, and p₀(x) and p₁(x) are probability density functions for a channel being free and occupied, respectively.
 11. A method for cognitive radio channel searching, comprising: determining an upper threshold and a lower threshold that will find a free channel in a minimum average searching time based on a channel occupancy probability π0 and the number of channels K, constrained by a target acceptable misdetection probability and a target acceptable false alarm probability, comprising: minimizing an average searching time according to an expected false alarm probability and an expected misdetection probability; and searching the K channels with a signaling device, wherein searching includes: sampling a channel; calculating a log-likelihood ratio (LLR) for the samples for each channel k; and comparing the LLR to the upper and lower thresholds to determine whether the channel is free or busy.
 12. A cognitive radio device, comprising: a search parameter determination module configured to determine an upper threshold and a lower threshold that will find a free channel in a minimum average searching time based on a channel occupancy probability π₀ and the number of channels K, constrained by a target acceptable misdetection probability and a target acceptable false alarm probability; and a search module configured to search the K channels with a signaling device using the determined upper threshold and lower threshold to find a free channel.
 13. The cognitive radio device of claim 12, wherein the search parameter determination module is configured to calculate an expected false alarm probability α and misdetection probability β based on the channel occupancy probability π₀ and the number of channels K.
 14. The cognitive radio device of claim 13, wherein the search parameter determination module is configured to calculate the lower threshold a as $a_{s} = {\log {\frac{\beta}{1 - \alpha}.}}$
 15. The cognitive radio device of claim 13, wherein the search parameter determination module is configured to calculate the upper threshold b as $b_{s} = {\log {\frac{1 - \beta}{\alpha}.}}$
 16. The cognitive radio device of claim 13, wherein the search parameter determination module is configured to minimize an average searching time according to an expected false alarm probability α and an expected misdetection probability β.
 17. The cognitive radio device of claim 16, wherein the search parameter determination module is configured to minimize the average search time by ${\min\limits_{\alpha,\beta}{E(T)}} = {{\frac{1 - \left( {{\left( {\alpha + \beta - 1} \right)\pi_{0}} + \left( {1 - \beta} \right)} \right)^{K}}{\beta - {\left( {\alpha + \beta - 1} \right)\pi_{0}}}\begin{pmatrix} {\left\lbrack {\frac{\pi_{0}\left( {1 - \alpha} \right)}{\mu_{0}} + \frac{\left( {1 - \pi_{0}} \right)\beta}{\mu_{1}}} \right\rbrack \times} \\ {{\log \frac{\beta}{1 - \alpha}} +} \\ {{\left\lbrack {\frac{\pi_{0}\alpha}{\mu_{0}} + \frac{\left( {1 - \pi_{0}} \right)\left( {1 - \beta} \right)}{\mu_{1}}} \right\rbrack \log \frac{1 - \beta}{a}} + \delta} \end{pmatrix}} - \delta}$ $\mspace{79mu} {{subject}\mspace{14mu} {to}\text{:}\frac{\left\lbrack {{\alpha\pi}_{0} + {\left( {1 - \beta} \right)\left( {1 - \pi_{0}} \right)}} \right\rbrack^{K} - \left\lbrack {\left( {1 - \beta} \right)\left( {1 - \pi_{0}} \right)} \right\rbrack^{K}}{1 - \left( {1 - \pi_{0}} \right)^{K}}}$ being less than or equal to the target acceptable false alarm probability, ${\beta \left( {1 - \pi_{0}} \right)}\frac{1 - \left( {{\left( {\alpha + \beta - 1} \right)\pi_{0}} + \left( {1 - \beta} \right)} \right)^{K}}{\beta - {\left( {\alpha + \beta - 1} \right)\pi_{0}}}$ being less than or equal to the target acceptable misdetection probability, α+<1, α>0, and β>0, where δ is a constant switching delay.
 18. The cognitive radio device of claim 12, wherein the search module is configured to collect samples from each channel k and to calculate a log-likelihood ratio (LLR) for the samples for each channel k.
 19. The cognitive radio device of claim 18, wherein the search module is configured to compare the LLR for each channel k to the determined upper and lower threshold to determine whether the channel is free or occupied.
 20. The cognitive radio device of claim 18, wherein the LLR Λ_(N) ^((k)) for a channel k is ${\Lambda_{N} = {\sum\limits_{n = 1}^{N}\; {\log \frac{p_{1}\left( y_{n} \right)}{p_{0}\left( y_{n} \right)}}}},$ where N is the maximum number of samples, y_(n) ^((k)) is the n^(th) sample on channel k, and p₀(x) and p₁(x) are probability density functions for a channel being free and occupied, respectively. 